An Overview of SIMD Parallel Systems AMT DAP , Thinking Machines CM - 200 , & MasPar MP - 1 N B MacDonald EPCC - TR 92 - 18
نویسنده
چکیده
SIMD computers are a class of massively parallel computer in which many processors simultaneously execute the same instructions on their own data. This paper briefly reviews the history of the development of SIMD computers, and gives an overview of the state of the art in SIMD computers by comparing the origins, hardware, software, performance, price and marketing of three commercially available SIMD computers: the Distributed Array Processor from AMT; the Connection Machine CM-200 from Thinking Machines Corporation; and the MasPar Computer Corporation MP-1. Presented at the Workshop on Parallel Computing, Quaid-i-Azam University, Islamabad, Pakistan, 26th–30th April 1992.
منابع مشابه
Comparison of Direct Particle Simulation on the MasPar MP - 2 and the Connection Machine CM - 2
Particle simulation as applied in the direct simulation Monte Carlo (DSMC) method is a technique for analyzing low density flows and is used extensively for engineering analysis of aerospace vehicles. This work compares two implementations of this method on outwardly similar massively parallel architectures. The MasPar MP-2 and the Connection Machine CM-2 are both massively parallel SIMD archit...
متن کاملPlurals: A SIMD Extension to EuLisp
There are now several versions of Lisp for massively parallel SIMD architec-tures like the Thinking Machines Connection Machine. We describe here the extensions made to EuLisp for data-parallel programming and their implementation on a speciic platform, a MasPar MP-1. Plural EuLisp, in keeping with the rest of the language, presents a collection of simple orthogonal operators which capture the ...
متن کاملA two-subcycle thinning algorithm and its parallel implementation on SIMD machines
A new parallel thinning algorithm with two subcycles is proposed and compared with other parallel thinning algorithms in terms of 8-connectedness degree, erosion, stability under pattern rotation, and boundary noise sensitivity. Computational issues are also reported based on the implementation of the thinning algorithm on the SIMD machines CM-200 and MasPar MPP-12000.
متن کاملParallel Game Tree Search on SIMD Machines
We describe an approach to the parallelization of game tree search on SIMD machines. It turns out that the single-instruction restriction of SIMD-machines is not a big obstacle for achieving eeciency. We achieve speedups up to 5850 on a 16K processor MasPar MP-1 if the search trees are suuciently large and if there are no strong move ordering heuristics. To our best knowledge, the largest speed...
متن کامل1 An Environment - Projection Approach to Radiosity for Mesh - Connected Computers
We describe a progressive re nement radiosity algorithm for highly-parallel meshconnected SIMD or MIMD computers. The technique is based on environmentprojection and scales easily to large machines and datasets. Form-factor computations can be performed using local communication by mapping the single-plane across the processor mesh. We report on the performance of an implementation on the MasPa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1992